The Kirkpatrick - Seidel Marriage Before Conquest Algorithm 1

نویسنده

  • Ben Peterson
چکیده

Figure 1: Size of hull vs. size of set 1 has a very small number of points on its convex hull in relation to the size of the whole set. In set P2, all points in the set are on the convex hull. Is there an algorithm which is output sensitive in relation to the number of points on the convex hull? It turns out there is such an algorithm KirkpatrickSeidel Marriage Before Conquest. Its complexity, as we shall see, is O(n log(h)), where n is the size of the point set P and h is the number of points on the convex hull of P .

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Ultimate Planar Convex Hull Algorithm?

We present a new planar convex hull algorithm with worst case time complexity O(n log H) where n is the size of the input set and H is the size of the output set, i.e. the number of vertices found to be on the hull. We also show that this algorithm is asymptotically worst case optimal on a rather realistic model of computation even if the complexity of the problem is measured in terms of input ...

متن کامل

On the Space Efficiency of the "Ultimate Planar Convex Hull Algorithm"

The output-sensitive “ultimate planar convex hull algorithm” of Kirkpatrick and Seidel [16] recently has been shown by Afshani et al. [1] to be instance-optimal. We revisit this algorithm with a focus on space-efficiency and prove that it can be implemented as an in-place algorithm, i.e., using O(1) working space.

متن کامل

Some Rigorous Results on the Sherrington-Kirkpatrick Spin Glass Model

We prove that in the high temperature regime (T/J > 1) the deviation of the total free energy of the Sherrington-Kirkpatrick (S-K) spin glass model from the easily computed logAv(ZN({βJ})) converges in distribution, as ΛΓ-KX), to a (shifted) Gaussian variable. Some weak results about the low temperature regime are also obtained.

متن کامل

1 8 M ay 2 00 4 Free energy in the generalized Sherrington - Kirkpatrick mean field model . Dmitry Panchenko

In [11] Michel Talagrand gave a rigorous proof of the Parisi formula in the SherringtonKirkpatrick model. In this paper we build upon the methodology developed in [11] and extend Talagrand’s result to a more general class of mean field models with spins distributed according to an arbitrary probability measure on the bounded subset of the real line and with external field term given by an arbit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006